|
|
| Book details / order |
| DATA STRUCTURES AND ALGORITHMS WITH JAVASCRIPT BRINGING CLASSIC COMPUTING APPROACHES TO THE WEB |
As an experienced javascript developer moving to server-side programming, you need to implement classic data structures and algorithms associated with conventional object-oriented languages like c# and java. this practical guide shows you how to work hands-on with a variety of storage mechanisms including linked lists, stacks, queues, and graphs within the constraints of the javascript environment.
determine which data structures and algorithms are most appropriate for the problems you’re trying to solve, and understand the tradeoffs when using them in a javascript program. an overview of the javascript features used throughout the book is also included.
this book covers:
arrays and lists: the most common data structures
stacks and queues: more complex list-like data structures
linked lists: how they overcome the shortcomings of arrays
dictionaries: storing data as key-value pairs
hashing: good for quick insertion and retrieval
sets: useful for storing unique elements that appear only once
binary trees: storing data in a hierarchical manner
graphs and graph algorithms: ideal for modeling networks
algorithms: including those that help you sort or search data
advanced algorithms: dynamic programming and greedy algorithms
about the author
michael mcmillan is an instructor of computer information systems at pulaski technical college in north little rock, ar. he is also an adjunct instructor of information science at the university of arkansas at little rock. before moving to academia, he was a programmer/analyst for arkansas children's hospital, where he worked in statistical computing and data analysis.
preface
1. the javascript programming environment and model
the javascript environment
javascript programming practices
declaring and intializing variables
arithmetic and math library functions in javascript
decision constructs
repetition constructs
functions
variable scope
recursion
objects and object-oriented programming
summary
2. arrays
javascript arrays defined
using arrays
creating arrays
accessing and writing array elements
creating arrays from strings
aggregate array operations
accessor functions
searching for a value
string representations of arrays
creating new arrays from existing arrays
mutator functions
adding elements to an array
removing elements from an array
adding and removing elements from the middle of an array
putting array elements in order
iterator functions
non–array-generating iterator functions
iterator functions that return a new array
two-dimensional and multidimensional arrays
creating two-dimensional arrays
processing two-dimensional array elements
jagged arrays
arrays of objects
arrays in objects
exercises
3. lists
a list adt
a list class implementation
append: adding an element to a list
remove: removing an element from a list
find: finding an element in a list
length: determining the number of elements in a list
tostring: retrieving a list’s elements
insert: inserting an element into a list
clear: removing all elements from a list
contains: determining if a given value is in a list
traversing a list
iterating through a list
a list-based application
reading text files
using lists to manage a kiosk
exercises
4. stacks
stack operations
a stack implementation
using the stack class
multiple base conversions
palindromes
demonstrating recursion
exercises
5. queues
queue operations
an array-based queue class implementation
using the queue class: assigning partners at a square dance
sorting data with queues
priority queues
exercises
6. linked lists
shortcomings of arrays
linked lists defined
an object-based linked list design
the node class
the linked list class
inserting new nodes
removing nodes from a linked list
doubly linked lists
circularly linked lists
other linked list functions
exercises
7. dictionaries
the dictionary class
auxiliary functions for the dictionary class
adding sorting to the dictionary class
exercises
8. hashing
an overview of hashing
a hash table class
choosing a hash function
a better hash function
hashing integer keys
storing and retrieving data in a hash table
handling collisions
separate chaining
linear probing
exercises
9. sets
fundamental set definitions, operations, and properties
set definitions
set operations
the set class implementation
more set operations
exercises
10. binary trees and binary search trees
trees defined
binary trees and binary search trees
building a binary search tree implementation
traversing a binary search tree
bst searches
searching for the minimum and maximum value
searching for a specific value
removing nodes from a bst
counting occurrences
exercises
11. graphs and graph algorithms
graph definitions
real-world systems modeled by graphs
the graph class
representing vertices
representing edges
building a graph
searching a graph
depth-first search
breadth-first search
finding the shortest path
breadth-first search leads to shortest paths
determining paths
topological sorting
an algorithm for topological sorting
implementing the topological sorting algorithm
exercises
12. sorting algorithms
an array test bed
generating random data
basic sorting algorithms
bubble sort
selection sort
insertion sort
timing comparisons of the basic sorting algorithms
advanced sorting algorithms
the shellsort algorithm
the mergesort algorithm
the quicksort algorithm
exercises
13. searching algorithms
sequential search
searching for minimum and maximum values
using self-organizing data
binary search
counting occurrences
searching textual data
exercises
14. advanced algorithms
dynamic programming
a dynamic programming example: computing fibonacci numbers
finding the longest common substring
the knapsack problem: a recursive solution
the knapsack problem: a dynamic programming solution
greedy algorithms
a first greedy algorithm example: the coin-changing problem
a greedy algorithm solution to the knapsack problem
exercises
index.
Author : Michael mcmillan
Publication : Oreilly
Isbn : 9789351105343
Store book number : 105
NRS 640.00
|
 |
|
|
|
|
|
|
|
| |
|
|
